Shortest expected delay routing for Erlang servers
نویسندگان
چکیده
منابع مشابه
Shortest Expected Delay Routing for Erlang Servers
The queueing problem with Poisson arrivals and two identical parallel Erlang servers is analyzed for the case of shortest expected delay routing. This problem may be represented as a random walk on the integer grid in the rst quadrant of the plane. An important aspect of the random walk is that it is possible to make large jumps in the direction of the boundaries. This feature gives rise to com...
متن کاملSteady-state analysis of shortest expected delay routing
We consider a queueing system consisting of two non-identical exponential servers, where each server has its own dedicated queue and serves the customers in that queue FCFS. Customers arrive according to a Poisson process and join the queue promising the shortest expected delay, which is a natural and near-optimal policy for systems with non-identical servers. This system can be modeled as an i...
متن کاملVANET: Expected Delay Analysis for Location Aided Routing (LAR) Protocol
Submitted in April, 2016; Accepted in July, 2016 Abstract – The Vehicular Ad-hoc Network (VANET) is a networking technology uses to create wireless network using mobile vehicles. In this network, the mobile vehicles work as intermediate node to transmit data packets over the wireless network and mobile nodes are free to move from one network to other network. All nodes in VANETs are highly mova...
متن کاملAn Efficient Algorithm for Shortest Path Multicast Routing under Delay and Delay Variation Constraints
A new heuristic algorithm is proposed for constructing multicast tree for multimedia and interactive applications that require certain quality of services, QoS. We consider two main QoS parameters that are the delay and delay variation. The problem is formulated as constructing shortest path tree under delay and delay variation constraints. The tree is used to concurrently transmit packets from...
متن کاملMinimum Expected Delay-Based Routing Protocol (MEDR) for Delay Tolerant Mobile Sensor Networks
It is a challenging work to develop efficient routing protocols for Delay Tolerant Mobile Sensor Networks (DTMSNs), which have several unique characteristics such as sensor mobility, intermittent connectivity, energy limit, and delay tolerability. In this paper, we propose a new routing protocol called Minimum Expected Delay-based Routing (MEDR) tailored for DTMSNs. MEDR achieves a good routing...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Queueing Systems
سال: 1996
ISSN: 0257-0130,1572-9443
DOI: 10.1007/bf01206552